Mean Labeling in Extended Duplicate Graph of Twig

Graceful and Skolem Graceful Labelings in Extended Duplicate Twig Graphs

In this paper, we show that the class of Extended Duplicate Graph of a Twig is Graceful and Skolem-graceful. AMS SUBJECT CLASSIFICATION: 05C78.

k-equitable mean labeling

Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path

A graph labeling is an assignment of integers to the vertices, or edges, or both subject to certain conditions. In this paper, we prove the existence of Z3magic, and Z4bi magic labelings for the middle graph of extended duplicate graph of a path by presenting algorithms.

Edge pair sum labeling of spider graph

An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...

Some Graph Operations Of Even Vertex Odd Mean Labeling Graphs

A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G){0, 2, 4, ... 2q-2,2q} such that the induced map f*: E(G) {1, 3, 5, ... 2q-1} defined by f*(uv)=     f u f v 2  is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. In this paper we pay our attention to p...